Informatics Publishing Limited

P. Kuppusamy ¹, K. Thirunavukkarasu ², B. Kalaavathi ³

Affiliations
1 Computer Science and Engineering Department, Vivekanandha College of Engineering for Women, Namakkal, Tamilnadu, IS
2 T.J.S Engineering College, Chennai, IN
3 Information Technology Department, K.S.R College of Technology, Namakkal, Tamilnadu, IN

Abstract

The Mobile nodes are communicating with each other with out centralized administration and data is accessed from the data source through multi-hop environment. The accessed data is stored in the mobile node’s cache for its own and neighbor’s future use. Caching is a significant process to store the frequently accessed data item in the MANET. Data availability and accessibility is a challenging task due to mobility of nodes, limited battery power and insufficient bandwidth. Cooperative caching addresses these challenges to improve the data availability and efficiency of data access by sharing and coordination among the mobile nodes. These challenges have received a tremendous amount of concentration from researchers and led to development of many different cooperative caching strategies. This paper attempts to provide the review and hypothetical analysis of various cooperative caching strategies in the mobile ad hoc networks based on their performance metrics such as cache hit ratio and average query delay with respect to cache size and number of mobile nodes. The Global Cluster Cooperative caching provides better performance than others in terms of cache hit and average query delay.

Keywords

Mobile Ad Hoc Network, Cooperative Caching, Cache Hit, Query Delay.

Full Text

     

P. S. Gomathi ¹, B. Kannan ¹, B. Kalaavathi ²

Affiliations
1 Department of ECE, V.S.B. Engineering College, Karur, IN
2 Department of IT, K.S. Rangasamy College of Technology, Tiruchengode, IN

Abstract

Image fusion is the process of combining complementary information from multiple input images of the same scene into an image, so that the resultant image contains a more accurate description of the scene than any of the individual source images. Only the portions of an image would appear sharp which comes on the focus of the camera and thus the concept of multi-focus image fusion comes into picture. The two basic fusion techniques are pixel level and region level fusion. Pixel level fusion deals with the operations on each and every pixel separately. The various techniques implemented under this method are averaging, stationary wavelet transform, discrete wavelet transform (DWT), principal component analysis (PCA). The most appreciated approach in region-based method is using the concept of spatial frequency with block method. The main drawback of this method is it is not an automatic method. In this paper, simple and efficient pixel level technique using wavelet transform is proposed. Experimental results on two pairs of multi-focus images like forensic images are compared in terms of extended spatial frequency and standard deviation as performance parameters. On the basis of these parameters, we can conclude that the proposed pixel level fusion technique is better compared to other pixel level fusion techniques.

Keywords

Image Fusion, Discrete Wavelet Transform.

Full Text

     

P. Kuppusamy ¹, B. Kalaavathi ², S. Chandra ³

Affiliations
1 Department of Computer Science and Engineering, Gnanamani College of Technology, IN
2 Department of Computer Science and Engineering, K.S.R Institute for Engineering and Technology, IN
3 Department of Computer Science, Selvamm Arts and Science College, IN

Abstract

A cooperative caching approach improves data accessibility and reduces query latency in Mobile Ad hoc Network (MANET). Maintaining the cache is challenging issue in large MANET due to mobility, cache size and power. The previous research works on caching primarily have dealt with LRU, LFU and LRU-MIN cache replacement algorithms that offered low query latency and greater data accessibility in sparse MANET. This paper proposes Memetic Algorithm (MA) to locate the better replaceable data based on neighbours interest and fitness value of cached data to store the newly arrived data. This work also elects ideal CH using Meta heuristic search Ant Colony Optimization algorithm. The simulation results shown that proposed algorithm reduces the latency, control overhead and increases the packet delivery rate than existing approach by increasing nodes and speed respectively.

Keywords

Data Replacement, Clustering, Cooperative Caching, Optimization.

Full Text